Proportional Share Resource Scheduler with Processor Affinity in Multiprocessor Systems
نویسندگان
چکیده
منابع مشابه
DPS: A Distributed Proportional-Share Scheduler in Computing Clusters
To improve cluster utilization, we propose a distributed proportional-share (DPS) CPU scheduling mechanism, which decouples a parallel program’s structural number of nodes (program specification) from the maximum resource usage at runtime (resource specification). In order to provide performance isolation between programs, we virtualize each node and run programs within virtual machines (VMs), ...
متن کاملVirtual-Time Round-Robin: An O(1) Proportional Share Scheduler
Proportional share resource management provides a flexible and useful abstraction for multiplexing timeshared resources. However, previous proportional share mechanisms have either weak proportional sharing accuracy or high scheduling overhead. We present VirtualTime Round-Robin (VTRR), a proportional share scheduler that can provide good proportional sharing accuracy with O(1) scheduling overh...
متن کاملStride Scheduling: Deterministic Proportional-Share Resource Management
This paper presents stride scheduling, a deterministic scheduling technique that efficiently supports the same flexible resource management abstractions introduced by lottery scheduling. Compared to lottery scheduling, stride scheduling achieves significantly improved accuracy over relative throughput rates, with significantly lower response time variability. Stride scheduling implements propor...
متن کاملConstant Bandwidth vs Proportional Share Resource Allocation
Due to the success of new multimedia technologies, there is a great interest for providing a resource allocation strategy suitable for multimedia applications. Many solutions proposed in literature are based on proportional share resource allocation, such as WFQ, WF2Q, EEVDF, or SFQ. In a previous paper, we showed how to perform resource reservation according to a Constant Bandwidth allocation....
متن کاملHill-Climbing SMT Processor Resource Scheduler
Multiple threads in SMT processor share resources to increase resource utilization and improve overall performance. At the same time, they compete against each other for the shared resources, causing resource monopolization or underutilization. Therefore, resource scheduling mechanism is important because it determines the throughput as well as fairness of the simultaneously running threads in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2007
ISSN: 1812-5638
DOI: 10.3923/itj.2007.561.566